Minimum Cost Multicommodity Flows in Dynamic Networks and Algorithms for their Finding
نویسندگان
چکیده
We consider the minimum cost multicommodity flow problem in dynamic networks with time-varying capacities of arcs and transit times on arcs that depend on the sort of commodity entering them. We assume that cost functions, defined on arcs, are nonlinear and depend on time and flow, and the demand function also depends on time. Moreover, we study the problem in the case when transit time functions depend on time and flow. The modification of the time-expanded network method and new algorithms for solving the considered classes of problems are proposed. Mathematics subject classification: 90B10, 90C35, 90C27.
منابع مشابه
Optimal multicommodity flows in dynamic networks and algorithms for their finding
In this paper we study two basic problems related to dynamic flows: maximum multicommodity flow and the minimum cost multicommodity flow problems. We consider these problems on dynamic networks with time-varying capacities of edges. For minimum cost multicommodity flow problem we assume that cost functions, defined on edges, are nonlinear and depending on time and flow, and the demand function ...
متن کاملThe minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
The dynamic version of the minimum cost multicommodity flow problem that generalizes the static minimum cost multicommodity flow problem is formulated and studied. This dynamic problem is considered on directed networks with a set of commodities, time-varying capacities, fixed transit times on arcs, and a given time horizon. We assume that cost functions, defined on edges, are nonlinear and dep...
متن کاملA Gravitational Search Algorithm-Based Single-Center of Mass Flocking Control for Tracking Single and Multiple Dynamic Targets for Parabolic Trajectories in Mobile Sensor Networks
Developing optimal flocking control procedure is an essential problem in mobile sensor networks (MSNs). Furthermore, finding the parameters such that the sensors can reach to the target in an appropriate time is an important issue. This paper offers an optimization approach based on metaheuristic methods for flocking control in MSNs to follow a target. We develop a non-differentiable optimizati...
متن کاملA Scalable Algorithm for the Minimum Expected Cost Restorable Flow Problem
We introduce a model for the computation of a multicommodity flow together with back-up flows for each commodity after any of a given set of failure states occurs in a network. We call such a total routing strategy a restorable multicommodity flow. One advantage of restorable flows over classical network protection methods, such as disjoint paths, is that the commodities may effectively share c...
متن کاملFaster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different approach to these problems which yields faster and much simpler algorithms. Our approach also allows us to substitute shortest path computations for min-cost flow computations in computing maximum concurrent flow and min...
متن کامل